Solving the Maximum Matching Problem on Bipartite Star123-Free Graphs in Linear Time
نویسنده
چکیده
The bipartite Star123-free graphs were introduced by V. Lozin in [1] to generalize some already known classes of bipartite graphs. In this paper, we extend to bipartite Star123-free graphs a linear time algorithm of J. L. Fouquet, V. Giakoumakis and J. M. Vanherpe for finding a maximum matching in bipartite Star123, P7-free graphs presented in [2]. Our algorithm is a solution of Lozin’s conjecture.
منابع مشابه
An O(n) Time Algorithm For Maximum Induced Matching In Bipartite Star_123-free Graphs
A matching in a graph is a set of edges no two of which share a common vertex. A matching M is an induced matching if no edge connects two edges of M. The problem of finding a maximum induced matching is known to be NP-hard in general and specifically for bipartite graphs. Lozin has been proposed an O(n) time algorithm for this problem on the class of bipartite Star123, Sun4-free graphs. In thi...
متن کاملLinear Time Recognition of Bipartite Star123-Free Graphs
In this paper, we present a linear time recognition algorithm for recognizing bipartite graphs without induced subgraphs isomorph to star123. Bipartite star123-free graphs are a natural generalization of both weak bisplit and Star123, Sun4free bipartite graphs, both further generalizing bicographs.
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملInduced matchings in asteroidal triple-free graphs
An induced matching M of a graph G is a set of pairwise nonadjacent edges such that no two edges of M are joined by an edge in G. The problem of /nding a maximum induced matching is known to be NP-hard even for bipartite graphs of maximum degree four. In this paper, we study the maximum induced matching problem on classes of graphs related to AT-free graphs. We /rst de/ne a wider class of graph...
متن کاملMaximum induced matching problem on hhd-free graphs
An induced matching in a graph is a set of edges such that no two edges in the set are joined by any third edge of the graph. An induced matching is maximum (MIM) if the number of edges in it is the largest among all possible induced matchings. It is known that finding the size of a MIM in a graph is NP-hard even if the graph is bipartite. It is also known that the size of a MIM in a chordal gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016